An Adjusted Intelligent Water Drop ( AIWD ) Algorithm in Flow Shop Scheduling Problem
نویسندگان
چکیده
163904-4747-IJECS-IJENS © August 2016 IJENS I J E N S Abstract— The intelligent water drops (IWD) algorithm was introduced in 2007 by Hamed Shah Hosseini, and has been successfully implemented to solve many types of optimization problems, especially traveling salesman problem (TSP). The algorithm works by imitating the behavior of the natural river water drops. Principally, the algorithm finds solution of the problem by constructing it iteratively in certain number of stages. In this paper, we adjusted (or slightly modified) the IWD algorithm in order to be properly implemented in the flow shop scheduling problem. The testing was conducted on the Taillard (1993) benchmark, and the results were compared with the ones obtained by MOACSA (multi objective ant colony system algorithm). Based on the comparison especially on the makespan values between both algorithms, it is seen that the adjusted IWD algorithm gave better solution than MOACSA on solving flow shop scheduling problem with the objective to optimize the makespan.
منابع مشابه
A modified branch and bound algorithm for a vague flow-shop scheduling problem
Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...
متن کاملAn Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملA cloud-based simulated annealing algorithm for order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling
Make-to-order is a production strategy in which manufacturing starts only after a customer's order is received; in other words, it is a pull-type supply chain operation since manufacturing is carried out as soon as the demand is confirmed. This paper studies the order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling with MTO production strategy, the objec...
متن کاملMulti-objective Differential Evolution for the Flow shop Scheduling Problem with a Modified Learning Effect
This paper proposes an effective multi-objective differential evolution algorithm (MDES) to solve a permutation flow shop scheduling problem (PFSSP) with modified Dejong's learning effect. The proposed algorithm combines the basic differential evolution (DE) with local search and borrows the selection operator from NSGA-II to improve the general performance. First the problem is encoded with a...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کامل